Conversion of Finite Automata To Regular Grammar